Optimal Multi-Modes Switching Problem in Infinite Horizon

This paper studies the problem of the deterministic version of the Verification Theorem for the optimal m-states switching in infinite horizon under Markovian framework with arbitrary switching cost functions. The problem is formulated as an extended impulse control problem and solved by means of probabilistic tools such as the Snell envelop of processes and reflected backward stochastic differential equations. A viscosity solutions approach is employed to carry out a finne analysis on the associated system of m variational inequalities with inter-connected obstacles. We show that the vector of value functions of the optimal problem is the unique viscosity solution to the system. This problem is in relation with the valuation of firms in a financial market

Quadratic BSDEs driven by a continuous martingale and application to utility maximization problem

In this paper, we study a class of quadratic Backward Stochastic Differential Equations (BSDEs) which arises naturally when studying the problem of utility maximization with portfolio constraints. We first establish existence and uniqueness results for such BSDEs and then, we give an application to the utility maximization problem. Three cases of utility functions will be discussed: the exponential, power and logarithmic ones

Longevity Risk and Capital Markets: The 2015-16 Update

International audienc

Machine Learning and Portfolio Optimization

The portfolio optimization model has limited impact in practice due to estimation issues when applied with real data. To address this, we adapt two machine learning methods, regularization and cross-validation, for portfolio optimization. First, we introduce performance-based regularization (PBR), where the idea is to constrain the sample variances of the estimated portfolio risk and return, which steers the solution towards one associated with less estimation error in the performance. We consider PBR for both mean-variance and mean-CVaR problems. For the mean-variance problem, PBR introduces a quartic polynomial constraint, for which we make two convex approximations: one based on rank-1 approximation and another based on a convex quadratic approximation. The rank-1 approximation PBR adds a bias to the optimal allocation, and the convex quadratic approximation PBR shrinks the sample covariance matrix. For the mean-CVaR problem, the PBR model is a combinatorial optimization problem, but we prove its convex relaxation, a QCQP, is essentially tight. We show that the PBR models can be cast as robust optimization problems with novel uncertainty sets and establish asymptotic optimality of both Sample Average Approximation (SAA) and PBR solutions and the corresponding efficient frontiers. To calibrate the right hand sides of the PBR constraints, we develop new, performance-based k-fold cross-validation algorithms. Using these algorithms, we carry out an extensive empirical investigation of PBR against SAA, as well as L1 and L2 regularizations and the equally-weighted portfolio. We find that PBR dominates all other benchmarks for two out of three of Fama-French data sets

A general comparison theorem for 1-dimensional anticipated BSDEs

Anticipated backward stochastic differential equation (ABSDE) studied the first time in 2007 is a new type of stochastic differential equations. In this paper, we establish a general comparison theorem for 1-dimensional ABSDEs with the generators depending on the anticipated term of $Z$.Comment: 8 page

Finite horizon optimal stopping of time-discontinuous functionals with applications to impulse control with delay

We study finite horizon optimal stopping problems for continuous-time Feller–Markov processes. The functional depends on time, state, and external parameters and may exhibit discontinuities with respect to the time variable. Both left- and right-hand discontinuities are considered. We investigate the dependence of the value function on the parameters, on the initial state of the process, and on the stopping horizon. We construct $\varepsilon$-optimal stopping times and provide conditions under which an optimal stopping time exists. We demonstrate how to approximate this optimal stopping time by solutions to discrete-time problems. Our results are applied to the study of impulse control problems with finite time horizon, decision lag, and execution delay

An overview of Viscosity Solutions of Path-Dependent PDEs

This paper provides an overview of the recently developed notion of viscosity solutions of path-dependent partial di erential equations. We start by a quick review of the Crandall- Ishii notion of viscosity solutions, so as to motivate the relevance of our de nition in the path-dependent case. We focus on the wellposedness theory of such equations. In partic- ular, we provide a simple presentation of the current existence and uniqueness arguments in the semilinear case. We also review the stability property of this notion of solutions, in- cluding the adaptation of the Barles-Souganidis monotonic scheme approximation method. Our results rely crucially on the theory of optimal stopping under nonlinear expectation. In the dominated case, we provide a self-contained presentation of all required results. The fully nonlinear case is more involved and is addressed in [12]